1

Realizability of delaunay triangulations

Year:
1990
Language:
english
File:
PDF, 702 KB
english, 1990
2

A non-hamiltonian, nondegenerate delaunay triangulation

Year:
1987
Language:
english
File:
PDF, 193 KB
english, 1987
7

Hamiltonian cycles in planar triangulations with no separating triangles

Year:
1990
Language:
english
File:
PDF, 786 KB
english, 1990
8

Polyhedra of Small Order and Their Hamiltonian Properties

Year:
1996
Language:
english
File:
PDF, 911 KB
english, 1996
10

An upper bound on the shortness exponent of 1-tough, maximal planar graphs

Year:
1991
Language:
english
File:
PDF, 292 KB
english, 1991
11

Graph-theoretical conditions for inscribability and Delaunay realizability

Year:
1996
Language:
english
File:
PDF, 790 KB
english, 1996
12

An upper bound on the shortness exponent of inscribable polytopes

Year:
1989
Language:
english
File:
PDF, 834 KB
english, 1989
13

Finding Hamiltonian cycles in Delaunay triangulations is NP-complete

Year:
1996
Language:
english
File:
PDF, 841 KB
english, 1996
14

Compressing quadtrees via common subtree merging

Year:
1989
Language:
english
File:
PDF, 549 KB
english, 1989
15

Distributed coordination with Messengers

Year:
1998
Language:
english
File:
PDF, 1.56 MB
english, 1998
16

Triangulating with high connectivity

Year:
1997
Language:
english
File:
PDF, 1.49 MB
english, 1997
17

Toughness and Delaunay triangulations

Year:
1990
Language:
english
File:
PDF, 1.55 MB
english, 1990
21

Distributed computing using autonomous objects

Year:
1996
Language:
english
File:
PDF, 1.10 MB
english, 1996
50

On the toughness index of planar graphs

Year:
1994
Language:
english
File:
PDF, 238 KB
english, 1994